Particle Swarm Optimization Algorithm with Multiple Phases for Solving Continuous Optimization Problems

نویسندگان

چکیده

An algorithm with different parameter settings often performs differently on the same problem. The are difficult to determine before optimization process. variants of particle swarm (PSO) algorithms studied as exemplars intelligence algorithms. Based concept building block thesis, a PSO multiple phases was proposed analyze relation between search strategies and solved problems. Two algorithm, which were termed fixed phase (PSOFP) dynamic (PSODP) compared six standard in experimental study. benchmark functions for single-objective numerical optimization, includes 12 50 100 dimensions, used study, respectively. results have verified generalization ability variants.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Particle Swarm Optimization Algorithm for Mixed-Variable Nonlinear Problems

Many engineering design problems involve a combination of both continuous anddiscrete variables. However, the number of studies scarcely exceeds a few on mixed-variableproblems. In this research Particle Swarm Optimization (PSO) algorithm is employed to solve mixedvariablenonlinear problems. PSO is an efficient method of dealing with nonlinear and non-convexoptimization problems. In this paper,...

متن کامل

PSOLVER: A new hybrid particle swarm optimization algorithm for solving continuous optimization problems

This study deals with a new hybrid global–local optimization algorithm named PSOLVER that combines particle swarm optimization (PSO) and a spreadsheet ‘‘Solver” to solve continuous optimization problems. In the hybrid PSOLVER algorithm, PSO and Solver are used as the global and local optimizers, respectively. Thus, PSO and Solver work mutually by feeding each other in terms of initial and sub-i...

متن کامل

Hybrid particle swarm algorithm for solving nonlinear constraint optimization problems

Based on the combination of the particle swarm algorithm and multiplier penalty function method for the constraint conditions, this paper proposes an improved hybrid particle swarm optimization algorithm which is used to solve nonlinear constraint optimization problems. The algorithm converts nonlinear constraint function into no-constraints nonlinear problems by constructing the multiplier pen...

متن کامل

Solving Constrained Nonlinear Optimization Problems with Particle Swarm Optimization

This paper presents a Particle Swarm Optimization (PSO) algorithm for constrained nonlinear optimization problems. In PSO, the potential solutions, called particles, are "flown" through the problem space by learning from the current optimal particle and its own memory. In this paper, preserving feasibility strategy is employed to deal with constraints. PSO is started with a group of feasible so...

متن کامل

Comparative Study of Particle Swarm Optimization and Genetic Algorithm Applied for Noisy Non-Linear Optimization Problems

Optimization of noisy non-linear problems plays a key role in engineering and design problems. These optimization problems can't be solved effectively by using conventional optimization methods. However, metaheuristic algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) seem very efficient to approach in these problems and became very popular. The efficiency of these ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Dynamics in Nature and Society

سال: 2021

ISSN: ['1607-887X', '1026-0226']

DOI: https://doi.org/10.1155/2021/8378579